Solving Heuristic Attacks Using Elliptic Curve Cryptography in Quantum Computer
نویسندگان
چکیده
Quantum Secret Sharing (QSS) is one of the important branch in Quantum Cryptography which combines Quantum with classical mechanics. The main objective of this paper is to propose elliptic curve cryptography (ECC) for solving heuristic attacks. The QSS and ECC methods has been tested in the following three quantum algorithms like Genetic Algorithm (GA), Tabu search algorithm (TS), Cuckoo search algorithm (CS). By considering the error rate, ECC method has higher error rate than the existing QSS method and secrecy also has been improved. The proposed ECC method is implemented and tested for 50 iterations and also comparison is made with QSS.
منابع مشابه
Solving Elliptic Curve Discrete Logarithm Problems Using Weil Descent
We provide the first cryptographically interesting instance of the elliptic curve discrete logarithm problem which resists all previously known attacks, but which can be solved with modest computer resources using the Weil descent attack methodology of Frey. We report on our implementation of index-calculus methods for hyperelliptic curves over characteristic two finite fields, and discuss the ...
متن کاملElliptic Curve Isogenies-Based Three-party Password Authenticated Key Agreement Scheme towards Quantum-Resistant
Since quantum computers came on the scene, the world has changed greatly, especially related to cryptography. Public key cryptosystem, particularly RSA cryptosystem cant resist the quantum computers attack, so some quantum-resistant schemes have been proposed mainly based on quantum key distribution (QKD) method or new resistance to quantum algorithms. However, to the best of our knowledge, no ...
متن کاملPublic-Key Cryptosystem Based on Isogenies
A new general mathematical problem, suitable for publickey cryptosystems, is proposed: morphism computation in a category of Abelian groups. In connection with elliptic curves over finite fields, the problem becomes the following: compute an isogeny (an algebraic homomorphism) between the elliptic curves given. The problem seems to be hard for solving with a quantum computer. ElGamal public-key...
متن کاملAn ECC-Based Mutual Authentication Scheme with One Time Signature (OTS) in Advanced Metering Infrastructure
Advanced metering infrastructure (AMI) is a key part of the smart grid; thus, one of the most important concerns is to offer a secure mutual authentication. This study focuses on communication between a smart meter and a server on the utility side. Hence, a mutual authentication mechanism in AMI is presented based on the elliptic curve cryptography (ECC) and one time signature (OTS) consists o...
متن کاملThe new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کامل